منابع مشابه
Smallest k point enclosing rectangle of arbitrary orientation
Given a set of points in 2D, the problem of identifying the smallest rectangle of arbitrary orientation, and containing exactly points is studied in this paper. The worst case time and space complexities of the proposed algorithm are ! " # $ % and & respectively. The algorithm is then used to identify the smallest square of arbitrary orientation containing points in # ' ( ) * + ' time. , .0/21%...
متن کاملSmallest axis-parallel rectangle enclosing at least k points
Let P be a set of n points on a two-dimensional plane. In this work, we present an algorithm that identifies a smallest area axis-parallel rectangle enclosing at least k points of P (1 < k ≤ n). The worst case time and space complexities of the algorithm are O(n) and O(n) respectively.
متن کاملEnclosing K Points in the Smallest Axis Parallel Rectangle
We consider the following clustering problem. Given a set S of n points in the plane, and given an integer k, n 2 < k n, we want to nd the smallest axis parallel rectangle (smallest perimeter or area) that encloses exactly k points of S. We present an algorithm which runs in time O(n + k(n ? k) 2) improving previous algorithms which run in time O(k 2 n) and do not perform well for larger k valu...
متن کاملFinding k points with a smallest enclosing square
An algorithm is presented that, given a set of n points in the plane and an integer k, 2 ::; k ::; n, finds k points with a smallest enclosing axes-parallel square. The algorithm has a running time of 0 (n log n+ kn log2 k) and uses 0 (n) space. The previously best known algorithmfor this problem takes O(knlogn) time and uses O(kn) space.
متن کاملApproximating smallest enclosing disks
#"%$'&( *) -time algorithms were designed for the planar case in the early 1970s [4, 6], the problem complexity was only settled in 1984 with N. Megiddo’s first linear time algorithm [3] for solving linear programs in fixed dimension. Unfortunately, these algorithms exhibit a large constant hidden in the big-Oh notation and do not perform so well in practice. E. Welzl [8] developed a simple rec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2020
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-020-00239-3